Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity
نویسندگان
چکیده
منابع مشابه
Mutual Private Set Intersection with Linear Complexity
A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol enables all players to get the desired result. In this work, we construct a mutual PSI protocol that is significantly more efficient than the stateof-the-art in the computation overhead. To the b...
متن کاملScalable Private Set Intersection Cardinality for Capture-Recapture with Multiple Private Datasets
In many scenarios it is beneficial to share private data among parties without mutual trust. One such scenario is the use of capture-recapture (CR) techniques to estimate population sizes from multiple private data sources of observed individuals. With Private Set Intersection Cardinality (PSIC) techniques, we can use CR with datasets from multiple parties while ensuring the privacy of the data...
متن کاملMulti Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security
In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, these ...
متن کاملMulti Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality of Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, the...
متن کاملPractical Private Set Intersection Protocols with Linear Complexity
The constantly increasing dependence on anytime-anywhere availability of data and the commensurately increasing fear of losing privacy motivate the need for privacy-preserving techniques. One interesting and common problem occurs when two parties need to privately compute an intersection of their respective sets of data. In doing so, one or both parties must obtain the intersection (if one exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2017
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2017.2721360